package leetcode;

import java.util.HashMap;

/**
 * @Project : AlgorithmLearning
 * @Package : Leetcode
 * @File : Q0001.java
 * @Author : WangRuoyu
 * @Date 2023/11/27 20:55
 */

public class Q0001 {
    public int[] twoSum(int[] nums, int target) {
        HashMap<Integer, Integer> map = new HashMap<>();
        for (int i = 0; i < nums.length; i++) {
            if (map.containsKey(target - nums[i])) {
                return new int[]{map.get(target - nums[i]), i};
            } else {
                map.put(nums[i], i);
            }
        }
        return new int[]{-1, -1};
    }

    public static void main(String[] args) {
        Q0001 sl = new Q0001();
    }
}
